Quasi-classical limit of Toda hierarchy andW-infinity symmetries

Previous results on quasi-classical limit of the KP hierarchy and itsW-infinity symmetries are extended to the Toda hierarchy. The Planck constant now emerges as the spacing unit of difference operators in the Lax formalism. Basic notions, such as dressing operators, Baker-Akhiezer functions, and tau function, are redefined.W _{1 +} symmetries of the Toda hierarchy are realized by suitable rescaling of the Date-Jimbo-Kashiara-Miwa vertex operators. These symmetries are contracted tow _{1 +} symmetries of the dispersionless hierarchy through their action on the tau function.     

Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces

This paper studies the complexity of computing (or approximating, or bounding) the various inner and outer radii of ann-dimensional convex polytope in the space ⁿ equipped with an _p norm or a polytopal norm. The polytopeP is assumed to be presented as the convex hull of finitely many points with rational coordinates (V-presented) or as the intersection of finitely many closed halfspaces defined by linear inequalities with rational coefficients (-presented). The innerj-radius ofP is the radius of a largestj-ball contained inP; it isP's inradius whenj = n and half ofP's diameter whenj = 1. The outerj-radius measures how wellP can be approximated, in a minimax sense, by an (n — j)-flat; it isP's circumradius whenj = n and half ofP's width whenj = 1. The binary (Turing machine) model of computation is employed. The primary concern is not with finding optimal algorithms, but with establishing polynomial-time computability or NP-hardness. Special attention is paid to the case in whichP is centrally symmetric. When the dimensionn is permitted to vary, the situation is roughly as follows: (a) for general -presented polytopes in _p spaces with 1相似文献   

Numerical solution of delay differential equations by uniform corrections to an implicit Runge-Kutta method

Summary In this paper we develop a class of numerical methods to approximate the solutions of delay differential equations. They are essentially based on a modified version, in a predictor-corrector mode, of the one-step collocation method atn Gaussian points. These methods, applied to ODE's, provide a continuous approximate solution which is accurate of order 2n at the nodes and of ordern+1 uniformly in the whole interval. In order to extend the methods to delay differential equations, the uniform accuracy is raised to the order 2n by some a posteriori corrections. Numerical tests and comparisons with other methods are made on real-life problems.This work was supported by CNR within the Progetto Finalizzato Informatica-Sottopr. P1-SOFMAT     

The effectiveness of solvents as hydrogen bond donors

Taft and Kamlet's -scale of solvent hydrogen bond donation ability is reexamined with regard to its correlations with three widely used polarity scales: Dimroth and Reichardt's E _T (30), Kosower's Z and Mayer's A _N , as well as with the _m values of the solvents when present as monomeric solutes. The correlation with E _T serves to extend the solvent -scale according to the expression:

Improving (Q)SAR predictions by examining bias in the selection of compounds for experimental testing

ABSTRACT

Existing data on structures and biological activities are limited and distributed unevenly across distinct molecular targets and chemical compounds. The question arises if these data represent an unbiased sample of the general population of chemical-biological interactions. To answer this question, we analyzed ChEMBL data for 87,583 molecules tested against 919 protein targets using supervised and unsupervised approaches. Hierarchical clustering of the Murcko frameworks generated using Chemistry Development Toolkit showed that the available data form a big diffuse cloud without apparent structure. In contrast hereto, PASS-based classifiers allowed prediction whether the compound had been tested against the particular molecular target, despite whether it was active or not. Thus, one may conclude that the selection of chemical compounds for testing against specific targets is biased, probably due to the influence of prior knowledge. We assessed the possibility to improve (Q)SAR predictions using this fact: PASS prediction of the interaction with the particular target for compounds predicted as tested against the target has significantly higher accuracy than for those predicted as untested (average ROC AUC are about 0.87 and 0.75, respectively). Thus, considering the existing bias in the data of the training set may increase the performance of virtual screening.     

Coulometric argentometric determination of microamounts of sulphur in iron and steel after reduction to hydrogen sulphide with iron(II) in strong phosphoric acid medium

A coulometric method was developed for the determination of microamounts of sulphur in iron and steel. Hydrogen sulphide is quantitatively evolved by reduction with iron(II) in strong phosphoric acid medium and is titrated with electrolytically generated silver ion from a silver anode. Microamounts of sulphide (2.96–224.3 μg) in sodium sulphide standard solutions could be determined with an error of only a few percent. Sulphur in a potassium sulphate standard solution is quantitatively reduced to hydrogen sulphide and could be separated from the solution by heating and determined accurately. Trace amounts of sulphur (7–100 μg g^?1) in iron and steels could be determined with a standard deviation of 0.7–2.1 μg g^?1.     

The way to measure quantitatively full dissolution and crystallization of polyamides in water up to 200 °C and above by DSC

The way to measure quantitatively full dissolution and crystallization of polyamides in water up to 200 °C and above by DSC is described. Stainless-steel high-pressure pans enable research on fully dissolving polyamides in water under vapor pressure. The results show clearly that polyamide 6 (PA6) is soluble in water under vapor pressure in the whole concentration range and that water acts as a crystallization and melting point suppressor. The maximum temperature depression is approximately 60 °C. This depression of the transitions is independent of concentration over a large range (10-70 mass% PA6 in water). When PA6 dissolves in water during heating, the polymer often sets to the sides of the DSC sample pan. Because of this the contact between the sample and the bottom of the pan reduces during measurement and therefore DSC heating curves are frequently curved. Adding steel wool to these stainless-steel high-pressure pans improves the measurements by increasing the thermal conductivity between the sample and pan bottom, and as a result the DSC curves become less curved. The interpretation of the measurements improves and the possibility of reproducible peak area calculations also in heating comes in sight.     

Stochastic Navier-Stokes equations

We construct a solution to stochastic Navier-Stokes equations in dimension n4 with the feedback in both the external forces and a general infinite-dimensional noise. The solution is unique and adapted to the Brownian filtration in the 2-dimensional case with periodic boundary conditions or, when there is no feedback in the noise, for the Dirichlet boundary condition. The paper uses the methods of nonstandard analysis.The research of this author was supported by an SERC Grant.     

Some regularity properties of algorithms and additive functions with respect to them

Summary The paper deals with the behaviour of the so-called algorithms with respect to interval filling sequences A connection is established between the uniquely representable points and the continuity points of the algorithms; also strong continuity properties on monotonic algorithms are proved. Finally the results are applied to additive functions. The theorems extend some former results by the authors, by I. Kátai and by A. Járai.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

An Ω(n 4/3) lower bound on the randomized complexity of graph properties

We improve King's (n ^5/4) lower bound on the randomized decision tree complexity of monotone graph properties to (n ^4/3). The proof follows Yao's approach and improves it in a different direction from King's. At the heart of the proof are a duality argument combined with a new packing lemma for bipartite graphs.The paper was written while the author was a graduate student at the University of Chicago and was completed at M.I.T. The work was supported in part by NSF under GRANT number NSF 5-27561, the Air Force under Contract OSR-86-0076 and by DIMACS (Center for Discret Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center-NSF-STC88-09648.